A direct algorithm for checking equivalence of LL(k) grammars
نویسندگان
چکیده
منابع مشابه
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional information such as incompleteness, uncertainty, and many others, but with the cost of time and space complexity. This paper addresses this problem, and proposes a new algorithm for Multi-valued Model Checking. While Chechi...
متن کاملA Method for Approximate Equivalence Checking
An approximate equivalence checking method is developed based on the use of partial Haar spectral diagrams (HSDs). Partial HSDs are defined and used to represent a subset of the Haar spectral coefficients for two functions. Due to the uniqueness properties of the Haar transform, a necessary condition for equivalence is that the individual coefficients must have the same value. The probability t...
متن کاملEquivalence-checking for Reversible Circuits
Reversible circuits arise in bottlenecks of quantum algorithms, such as Shor’s and Grover’s. More generally, they offer a way to embed an arbitrary conventional computation into the quantum domain, where it can be performed on multiple input combinations at once. Performance optimizations modify reversible circuits for speed, depth and to abide by physical constraints, e.g., of spin-chain archi...
متن کاملChecking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of co...
متن کاملLatch Inference for Equivalence Checking
A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of the latch loop boolean equation that allows us to obtain a phase and permutation independent procedure for latch inference. This method allows a better latch matching in equivalence checking tools.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1977
ISSN: 0304-3975
DOI: 10.1016/0304-3975(77)90016-0